Loose Hamiltonian cycles forced by large (k− 2)-degree - sharp version
نویسندگان
چکیده
منابع مشابه
Improved degree conditions for 2-factors with k cycles in hamiltonian graphs
In this paper, we consider conditions that ensure a hamiltonian graph has a 2-factor with exactly k cycles. Brandt et al. proved that if G is a graph on n ≥ 4k vertices with minimum degree at least n2 , then G contains a 2-factor with exactly k cycles; moreover this is best possible. Faudree et al. asked if there is some c < 1 2 such that δ(G) ≥ cn would imply the existence of a 2-factor with k...
متن کاملLoose Hamilton Cycles in Random k-Uniform Hypergraphs
In the random k-uniform hypergraph Hn,p;k of order n each possible k-tuple appears independently with probability p. A loose Hamilton cycle is a cycle of order n in which every pair of adjacent edges intersects in a single vertex. We prove that if pn/ logn tends to infinity with n then lim n→∞ 2(k−1)|n Pr(Hn,p;k contains a loose Hamilton cycle) = 1.
متن کاملDegree conditions for k-ordered hamiltonian graphs
For a positive integer k, a graph G is k-ordered hamiltonian if for every ordered sequence of k vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order. It is shown that if G is a graph of order n with 3 k n /2, and deg(u)þ deg(v ) nþ (3k 9)/2 for every pair u; v of nonadjacent vertices of G, then G is k-ordered hamiltonian. Minimum degree condition...
متن کاملDrawing Hamiltonian Cycles with No Large Angles
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n straight line edges such that the angle between any two consecutive edges is at most 2π/3. For n = 4 and 6, this statement is tight. It is also shown that every even-element point set S can be partitioned into at most two s...
متن کاملOrientations of hamiltonian cycles in large digraphs
We prove that, with some exceptions, every digraph with n 3 9 vertices and at least ( n 1) (n 2) + 2 arcs contains all orientations of a Hamiltonian cycle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2017
ISSN: 1571-0653
DOI: 10.1016/j.endm.2017.06.026